A tabu search-based heuristic for a new capacitated cyclic inventory routing problem
نویسندگان
چکیده
منابع مشابه
A novel heuristic algorithm for capacitated vehicle routing problem
The vehicle routing problem with the capacity constraints was considered in this paper. It is quite difficult to achieve an optimal solution with traditional optimization methods by reason of the high computational complexity for large-scale problems. Consequently, new heuristic or metaheuristic approaches have been developed to solve this problem. In this paper, we constructed a new heuristic ...
متن کاملTabu Search Heuristic for a Two- Echelon Location-Routing Problem
In this paper we tackle a two-echelon location-routing problem (2E-LRP) by a tabu search metaheuristic. The aim is to define the location and number of two kinds of capacitated facilities, the size of two different vehicle fleets and the related routes on each echelon. The proposed Tabu Search (TS) for the 2E-LRP is based on the decomposition of the problem in two location-routing sub-problems,...
متن کاملA Two-Phase Hybrid Heuristic Method for a Multi-Depot Inventory-Routing Problem
In this study, a two phase hybrid heuristic approach was proposed to solve the multi-depot multi-vehicle inventory routing problem (MDMVIRP). Inventory routing problem (IRP) is one of the major issues in the supply chain networks that arise in the context of vendor managed systems (VMI) The MDMVIRP combines inventory management and routing decision. We are given on input a fleet of homogeneous ...
متن کاملA New Mathematical Formulation for Multi-product Green Capacitated Inventory Routing Problem in Perishable Products Distribution Considering Dissatisfaction of Customers
In this paper, we propose a new mathematical model for Capacitated Inventory Routing Problem (CIRP), which considers freshly delivery of perishable products to the customers’ location; otherwise, a reduction in products’ demand may occur. Therefore, we attempt to plan delivering process of products at the right time to avoid extra inventory causing increase in age of products. This ...
متن کاملA Network Flow-Based Tabu Search Heuristic for the Vehicle Routing Problem
We develop a new local search approach based on a network ow model that is used to simultaneously evaluate several customer ejection and insertion moves. We use this approach and a direct customer swap procedure to solve the well-known Vehicle Routing Problem. The capacity constraints are relaxed using penalty terms whose parameter values are adjusted according to time and search feedback. Tabu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Mathematics in Operational Research
سال: 2014
ISSN: 1757-5850,1757-5869
DOI: 10.1504/ijmor.2014.063159